Summarizing CSP hardness with continuous pro distributions

نویسندگان

  • Daniel Frost
  • Irina Rish
  • Lluis Vila
چکیده

We present empirical evidence that the distribution of effort required to solve CSPs randomly generated at the 50% satisfiable point, when using a backtracking algorithm, can be approximated by two standard families of continuous probability distribution functions. Solvable problems can be modelled by the Weibull distribution, and unsolvable problems by the lognormal distribution. These distributions fit equally well over a variety of backtracking based algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Summarizing CSP Hardness with Continuous Probability Distributions

We present empirical evidence that the distribution of eeort required to solve CSPs randomly generated at the 50% satissable point, when using a backtracking algorithm, can be approximated by two standard families of continuous probability distribution functions. Solvable problems can be modelled by the Weibull distribution , and unsolvable problems by the lognormal distribution. These distribu...

متن کامل

Towards a Characterization of Constant-Factor Approximable Min CSPs

We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. says that, under the mild technical condition that Γ contains the equality relation, the basic LP r...

متن کامل

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the lit-

متن کامل

Dietary Protein Sources Affect Internal Quality of Raw and Cooked Shell Eggs under Refrigerated Conditions

This study was conducted to evaluate the effects of various protein sources (soybean meal, SBM; cottonseed protein, CSP; double-zero rapeseed meal, DRM) on the internal quality of refrigerated eggs. A total of 360 laying hens (32 wk of age) were randomly allotted to six treatment groups (five replicates per treatment) and fed diets containing SBM, CSP, or DRM individually or in combination with...

متن کامل

Conditional Inapproximability and Limited Independence

Understanding the theoretical limitations of efficient computation is one of the most fundamental open problems of modern mathematics. This thesis studies the approximability of intractable optimization problems. In particular, we study so-called Max CSP problems. These are problems in which we are given a set of constraints, each constraint acting on some k variables, and are asked to find an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999